Scaling and non-standard matching theorems

Some Matching Theorems

A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge. If in addition each class contains exactly n representatives, G is said to be of type (n, n) . In what follows all our graphs will be of this form . Let every vertex in A be joined to every vertex in B . Then we say that G is saturated. A mat...

Matching Theorems for Combinatorial

Matching Theorems for Combinatorial Geometries

New matching theorems and their applications

In this paper, we establish two matching theorems involving three maps. As applications, KKM type theorems, intersections theorems, analytic alternatives and minimax inequalities are obtained. AMS subject classifications: 54H25, 54C60

Non-Archimedean fuzzy metric spaces and Best proximity point theorems

In this paper, we introduce some new classes of proximal contraction mappings and establish  best proximity point theorems for such kinds of mappings in a non-Archimedean fuzzy metric space. As consequences of these results, we deduce certain new best proximity and fixed point theorems in partially ordered non-Archimedean fuzzy metric spaces. Moreover, we present an example to illustrate the us...